By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 9, Issue 3, pp. 441-664

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

The Mathematics of Record Handling

Hartmut Ehrig and Barry K. Rosen

pp. 441-469

Conditions for Optimality of the Huffman Algorithm

D. Stott Parker, Jr.

pp. 470-489

Storage Modification Machines

A. Schönhage

pp. 490-508

A Correct Preprocessing Algorithm for Boyer–Moore String-Searching

Wojciech Rytter

pp. 509-512

The Pebbling Problem is Complete in Polynomial Space

John R. Gilbert, Thomas Lengauer, and Robert Endre Tarjan

pp. 513-524

Vector Iteration in Pointed Iterative Theories

Stephen L. Bloom, Calvin C. Elgot, and Jesse B. Wright

pp. 525-540

Bounds on the Scheduling of Typed Task Systems

Jeffrey M. Jaffe

pp. 541-551

Random Graphs and Graph Optimization Problems

Bruce W. Weide

pp. 552-557

Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan

pp. 558-565

Bounds on Selection Networks

Andrew Chi-Chih Yao

pp. 566-582

An Optimal Agorithm for Symbolic Factorization of Symmetric Matrices

Alan George and Joseph W. H. Liu

pp. 583-593

Design and Analysis of a Data Structure for Representing Sorted Lists

Mark R. Brown and Robert E. Tarjan

pp. 594-614

Applications of a Planar Separator Theorem

Richard J. Lipton and Robert Endre Tarjan

pp. 615-627

Random Graph Isomorphism

László Babai, Paul Erdos, and Stanley M. Selkow

pp. 628-635

Space Lower Bounds for Maze Threadability on Restricted Machines

Stephen A. Cook and Charles W. Rackoff

pp. 636-652

Predictors of Context-Free Grammars

Kuo-Chung Tai

pp. 653-664